package leetcode_2401_2500;

public class LeeCode_2496 {
    public static void main(String[] args) {

    }
    private static int maximumValue(String[] strs) {
        int ans = 0;
        for (String str : strs) {
            boolean flag = false;
            for (int i = 0; i < str.length(); i++) {
                if (str.charAt(i) < '0' || str.charAt(i) >'9'){
                    flag = true;
                    break;
                }
            }
            if (flag){
                ans = Math.max(ans, str.length());
            }else {
                ans = Math.max(ans, Integer.parseInt(str));
            }
        }
        return ans;
    }
}